propositional logic program
Sequential decomposition of propositional logic programs
The sequential composition of propositional logic programs has been recently introduced. This paper studies the sequential {\em decomposition} of programs by studying Green's relations $\mathcal{L,R,J}$ -- well-known in semigroup theory -- between programs. In a broader sense, this paper is a further step towards an algebraic theory of logic programming.
Guarded resolution for answer set programming
We describe a variant of resolution rule of proof and show that it is complete for stable semantics of logic programs. We show applications of this result.